Search results for "Change of basis"
showing 3 items of 3 documents
Tensor product multiresolution analysis with error control for compact image representation
2002
A class of multiresolution representations based on nonlinear prediction is studied in the multivariate context based on tensor product strategies. In contrast to standard linear wavelet transforms, these representations cannot be thought of as a change of basis, and the error induced by thresholding or quantizing the coefficients requires a different analysis. We propose specific error control algorithms which ensure a prescribed accuracy in various norms when performing such operations on the coefficients. These algorithms are compared with standard thresholding, for synthetic and real images.
The $\varepsilon$-form of the differential equations for Feynman integrals in the elliptic case
2018
Feynman integrals are easily solved if their system of differential equations is in $\varepsilon$-form. In this letter we show by the explicit example of the kite integral family that an $\varepsilon$-form can even be achieved, if the Feynman integrals do not evaluate to multiple polylogarithms. The $\varepsilon$-form is obtained by a (non-algebraic) change of basis for the master integrals.
Quantum Walk Search on Johnson Graphs
2016
The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dynamics. This method can also be applied to general Johnson graphs $J(n,k)$ with fixed $k$.